Complete Proof Systems for Observation Congruences in Finite-Control pi-Calculus
نویسنده
چکیده
Proof systems for weak bisimulation congruences in the finite-control π-calculus are presented and their completeness proved. This study consists of two major steps: first complete proof systems for guarded recursions are obtained; then sound laws sufficient to remove any unguarded recursions are formulated. These results lift Milner’s axiomatisation for observation congruence in regular pure-CCS to the π-calculus. The completeness proof relies on the symbolic bisimulation technique.
منابع مشابه
Tau laws for pi calculus
The paper investigates the non-symbolic algebraic semantics of the weak bisimulation congruenceson finite pi processes. The weak bisimulation congruences are studied both in the absence and inthe presence of the mismatch operator. Some interesting phenomena about the open congruences arerevealed. Several new tau laws are discovered and their relationship is discussed. The contributi...
متن کاملA Complete Proof System for a Dynamic Epistemic Logic Based upon Finite pi-Calculus Processes
The pi-calculus process algebra describes the interaction of concurrent and communicating processes. In this paper we present the syntax and semantics of a dynamic epistemic logic for multi-agent systems, where the epistemic actions are finite processes in the pi-calculus. We then extend the language to include actions from a specified set of action structures. We define a proof system for the ...
متن کاملStatic Analysis Versus Model Checking for Bug Finding
The benefits of exposing calls and returns p. 2 A compositional approach to the stochastic dynamics of gene networks p. 4 Games other people play p. 5 Type-directed concurrency p. 6 Multiport interaction nets and concurrency p. 21 Model checking for [pi]-calculus using proof search p. 36 A game semantics of the asynchronous [pi]-calculus p. 51 Efficient on-the-fly algorithms for the analysis of...
متن کاملBisimulations for a Calculus of Broadcasting Systems
We develop a theory of bisimulation equivalence for the broadcast calculus CBS Both the strong and weak versions of bisimulation congruence we study are justi ed in terms of a characterisation as the largest CBS con gruences contained in an appropriate version of barbed bisimulation We then present sound and complete proof systems for both the strong and weak congruences over nite expressions T...
متن کاملProof System for Applied Pi Calculus
A symbolic-style proof system is presented to reason about observational equivalence for applied pi-calculus. The proofs of the soundness and completeness of the system rely on a recently developed theory of symbolic bisimulation for applied pi-calculus. The completeness result of the proof system is restricted to the finite fragment of applied pi-calculus which admits finite partition, and it ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998